Deterministic finite automaton

Results: 142



#Item
41CS109B Notes for LectureNondeterministic Automata Looking for Substrings We can build an NFA to recognize a string that ends in any given substring a1a2 a if we:

CS109B Notes for LectureNondeterministic Automata Looking for Substrings We can build an NFA to recognize a string that ends in any given substring a1a2 a if we:

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:53
42Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BA

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2005-07-08 16:23:57
43Greedy Regular Expression Matching Alain Frisch1,2,? and Luca Cardelli3 2 1 ´ Ecole Normale Sup´erieure (Paris)

Greedy Regular Expression Matching Alain Frisch1,2,? and Luca Cardelli3 2 1 ´ Ecole Normale Sup´erieure (Paris)

Add to Reading List

Source URL: www.cduce.org

Language: English - Date: 2013-12-06 16:18:28
44software construction Editors: Andy Hunt and Dave Thomas ■ The Pragmatic Programmers a n d y @ p r a g m a t i c p r o g r a m m e r. c o m ■ d a v e @ p r a g m a t i c p r o g r a m m e r. c o m State Machines Dave

software construction Editors: Andy Hunt and Dave Thomas ■ The Pragmatic Programmers a n d y @ p r a g m a t i c p r o g r a m m e r. c o m ■ d a v e @ p r a g m a t i c p r o g r a m m e r. c o m State Machines Dave

Add to Reading List

Source URL: media.pragprog.com

Language: English - Date: 2007-10-31 17:44:24
45Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci

Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci

Add to Reading List

Source URL: www.win.tue.nl

Language: English - Date: 2011-10-17 18:08:03
46Automata theory for XML researchers∗ Frank Neven University of Limburg 1

Automata theory for XML researchers∗ Frank Neven University of Limburg 1

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-07-04 06:02:40
47PII:

PII:

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-03-05 16:37:08
48MoChArt 2005 Preliminary Version Incremental Verification for On-the-Fly Controller Synthesis David J. Musliner and Michael J. S. Pelican 1,2 Honeywell Laboratories

MoChArt 2005 Preliminary Version Incremental Verification for On-the-Fly Controller Synthesis David J. Musliner and Michael J. S. Pelican 1,2 Honeywell Laboratories

Add to Reading List

Source URL: rpgoldman.goldman-tribe.org

Language: English - Date: 2009-08-06 12:04:58
49Fast and Precise Sanitizer Analysis with B EK Pieter Hooimeijer University of Virginia Benjamin Livshits Microsoft Research

Fast and Precise Sanitizer Analysis with B EK Pieter Hooimeijer University of Virginia Benjamin Livshits Microsoft Research

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-06-09 19:12:49
50Phase Transitions within Grammatical Inference Nicolas Pernot, Antoine Cornu´ejols & Mich`ele Sebag Laboratoire de Recherche en Informatique, CNRS UMR 8623 Bˆat.490, Universit´e de Paris-Sud, OrsayOrsay Cedex (

Phase Transitions within Grammatical Inference Nicolas Pernot, Antoine Cornu´ejols & Mich`ele Sebag Laboratoire de Recherche en Informatique, CNRS UMR 8623 Bˆat.490, Universit´e de Paris-Sud, OrsayOrsay Cedex (

Add to Reading List

Source URL: www.ijcai.org

Language: English - Date: 2005-07-11 15:50:42